On the exhaustive generation of plane partitions
نویسندگان
چکیده
منابع مشابه
On the exhaustive generation of plane partitions
We present a CAT (Constant Amortized Time) algorithm for generating all plane partitions of an integer n, that is, all integer matrices with non-increasing rows and columns having sum n. © 2012 Elsevier B.V. All rights reserved.
متن کاملm-compositions and m-partitions: exhaustive generation and Gray code
In this paper we give an exhaustive generation algorithm for the class of m-compositions of integers with fixed m. Moreover we define a Gray code to list these combinatorial objects according to a particular order. Finally, we define m-partitions, which are an m-dimensional generalization of integer partitions, and an exhaustive generation algorithm for m-partitions, based on the same ideas use...
متن کاملOn the exhaustive generation of convex permutominoes
A permutomino of size n is a polyomino determined by a pair (π1, π2) of permutations of size n + 1, such that π1(i) 6= π2(i), for 1 ≤ i ≤ n+ 1. In this paper, after recalling some enumerative results about permutominoes, we give a first algorithm for the exhaustive generation of a particular class of permutominoes, the convex permutominoes, proving that its cost is proportional to the number of...
متن کاملPlane Partitions
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular, we consider bounded plane partitions, symmetric plane partitions and weak reverse plane partitions. Using the combinatorial interpretations of Schur functions in relation to semistandard Young tableaux, we rely on the properties of symmetric functions. In our ...
متن کاملSymmetries of plane partitions
We introduce a new symmetry operation, called complementation, on plane partitions whose three-dimensional diagram is contained in a given box. This operation was suggested by work of Mills, Robbins, and Rumsey. There then arise a total of ten inequivalent problems concerned with the enumeration of plane partitions with a given symmetry. Four of these ten problems had been previously considered...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.11.013